A recognition algorithm for simple-triangle graphs
نویسندگان
چکیده
منابع مشابه
A recognition algorithm for simple-triangle graphs
A simple-triangle graph is the intersection graph of triangles that are defined by a point on a horizontal line and an interval on another horizontal line. The time complexity of the recognition problem for simple-triangle graphs was a longstanding open problem, which was recently settled. This paper provides a new recognition algorithm for simple-triangle graphs to improve the time bound from ...
متن کاملTriangle Graphs and Simple Trapezoid Graphs
In the literature of graph recognition algorithms, two of the most extensively covered graphs are interval graphs and permutation graphs [6, 2]. One way of generalizing both interval graphs and permutation graphs is the intersection graph of a collection of trapezoids with corner points lying on two parallel lines. Such a graph is called the trapezoid graph [3, 4]; Ma and Spinrad [8] show that ...
متن کاملA simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
In this paper, we consider the problem of finding a maximum weight 2-matching containing no cycle of length at most three in a weighted simple graph, which we call the weighted trianglefree 2-matching problem. Although the polynomial solvability of this problem is still open in general graphs, a polynomial-time algorithm is given by Hartvigsen and Li for the problem in subcubic graphs, i.e., gr...
متن کاملThe Recognition of Triangle Graphs
Trapezoid graphs are the intersection graphs of trapezoids,where every trapezoid has a pair of opposite sides lying on two parallel lines L1 and L2 of the plane. This subclass of perfect graphs has received considerable attention as it generalizes in a natural way both interval and permutation graphs. In particular, trapezoid graphs have been introduced in order to generalize some well known ap...
متن کاملA vertex ordering characterization of simple-triangle graphs
Consider two horizontal lines in the plane. A pair of a point on the top line and an interval on the bottom line defines a triangle between two lines. The intersection graph of such triangles is called a simple-triangle graph. This paper shows a vertex ordering characterization of simple-triangle graphs as follows: a graph is a simple-triangle graph if and only if there is a linear ordering of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2020
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.11.009